Long cycles in certain graphs of large degree
نویسندگان
چکیده
منابع مشابه
Long Cycles in Certain Graphs of Large Degree
Let G be a connected graph of order n and X = {x ∈ V : d(x)≥n/2}. Suppose |X| ≥ 3 and G satisfies the modified Fan’s condition. We show that the vertices of the block B of G containing X form a cycle. This generalizes a result of Fan. We also give an efficient algorithm to obtain such a cycle. The complexity of this algorithm is O(n2). In case G is 2-connected, the condition |X| ≥ 3 can be remo...
متن کاملLong cycles in graphs with large degree sums
A number of results are established concerning long cycles in graphs with large degree sums. Let G be a graph on n vertices such that d(x) + d(y) + d(z) 3s for all triples of independent vertices x, y, z. Let c be the length of a longest cycle in G and (Y the cardinality of a maximum independent set of vertices. If G is l-tough and s an, then every longest cycle in G is a dominating cycle and c...
متن کاملLong D3-cycles in graphs with large minimum degree
It is shown that if G is a 2-connected graph on n vertices, with minimum degree δ such that n ≤ 4δ− 6, and with a maximum independent set of cardinality α, then G contains a cycle of length at least min {n, n+ 2δ − 2α− 2} or G ∈ F , where F denotes a well-known class of nonhamiltonian graphs of connectivity 2.
متن کاملEdge-disjoint Hamilton Cycles in Regular Graphs of Large Degree
Theorem 1 implies that if G is a A:-regular graph on n vertices and n ^ 2k, then G contains Wr(n + 3an + 2)] edge-disjoint Hamilton cycles. Thus we are able to increase the bound on the number of edge-disjoint Hamilton cycles by adding a regularity condition. In [5] Nash-Williams conjectured that if G satisfies the conditions of Theorem 2, then G contains [i(n + l)] edge-disjoint Hamilton cycle...
متن کاملLong paths and cycles in random subgraphs of graphs with large minimum degree
For a given finite graph G of minimum degree at least k, let Gp be a random subgraph of G obtained by taking each edge independently with probability p. We prove that (i) if p ≥ ω/k for a function ω = ω(k) that tends to infinity as k does, then Gp asymptotically almost surely contains a cycle (and thus a path) of length at least (1− o(1))k, and (ii) if p ≥ (1 + o(1)) ln k/k, then Gp asymptotica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2000
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171200003653